19 Covariance Matrices

Recall last note, Covariance matrix is defined as Cov(X→)=E[(X→−μ→)(X→−μ→)T],X→,μ→∈Rn.
For all fixed v→∈Rn, v→TCov(X→)v→=E[v→T(X→−μ→)(X→−μ→)v→]=E[Y2]≥0,
here Y=v→T(X→−μ→)∈R.

Positive (semi-)definite matrix

Let M∈Rn×n be a real-valued symmetric n×n matrix, i.e. M=MT.

  1. M is called positive definite, if any non-zero vector x→:x→TMx→>0.
    • All eigenvalues are real and positive.
    • M is non-singular (invertible).
  2. M is called positive semi-definite, if x→TMx→≥0,∀x→∈Rn.
    • All eigenvalues are real and non-negative.

Thus covariance matrix must be positive semi-definite.

Theorem

  1. M is positive semi-definite if and only if M=AAT where A is some real square matrix.
  2. M is positive definite if and only if M=AAT where A is some real non-singular square matrix.

Let Σ be a positive semi-definite matrix, and let A be its square-root matrix. Then Σ=Cov(X→), where X→=AZ→ and Z→∼Nn(0→,Σn).
More generally,

When Σ is non-singular, Σ is invertible. By the proof we have Σ=QΛQT, soΣ−1=QΛ−1QT=QΛ−12Λ−12QT=QΛ−12QT⏟Σ−12QΛ−12QT⏟Σ−12.
Where Λ−1=diag{λ1−1,⋯,λn−1},Λ−12=diag{λ1−12,⋯,λn−12}.
So if x→∼Nn(μ→,Σ), where Σ is positive definite, then we can do standardization Z→=Σ−12(X→−μ→)∼Nn(0→,In).


MGF


Multivariate normal & χ2 distribution

Idempotent

A square matrix M is said to be idempotent if M2=M.

Fact

M∈Rn×m is a symmetric and idempotent matrix of rank r≤n iffM=q→1q→1T+⋯+q→rq→rT, where {q→1,⋯,q→r} are r orthogonal vectors in Rn.

Theorem

Suppose X→∼Nn(μ→,In) and M is an n×n symmetric matrix. If M is idempotent with rank r, then (X→−μ→)TM(X→−μ→)∼χr2.

In fact, the converse is also true.

The above result has many applications in Statistics.
E.g., X1,⋯,Xn∼i.i.dN(μ,σ2). Sn=X1+⋯+Xn. Then, the above result can be used to show1σ2∑i=1n(Xi−Snn)2∼χn−12.


Multivariate CLT

(Recall 1-dim CLT.)

Multivariate Central Limit Theorem

Let X→1,⋯,X→n be a sequence of iid Rk-valued random vectors whereX→i=[Xi1⋮Xik],E[X→i]=μ→,E[Xij2]<∞,Cov(X→i)=V,∀1≤j≤k.
Let S→n=X→1+⋯+X→n. Then n(S→nn−μ→)→dNk(0→,V),n→∞.
If V is non-singular, thennV−12(S→nn−μ→)→dNk(0→,Ik),n→∞.

Pearson

∑i=1k(Cn,j−npj)2npj→dχk−12,n→∞.

Fact: M is idempotent and symmetric with rank(M)=k−1. (Apply the theorem. )